Polynomial equations with one catalytic variable, algebraic series and map enumeration
نویسندگان
چکیده
منابع مشابه
Rational and algebraic series in combinatorial enumeration
Let A be a class of objects, equipped with an integer size such that for all n the number an of objects of size n is finite. We are interested in the case where the generating function ∑ n ant n is rational, or more generally algebraic. This property has a practical interest, since one can usually say a lot on the numbers an, but also a combinatorial one: the rational or algebraic nature of the...
متن کاملA Polynomial Time Algorithm for Diophantine Equations in One Variable
We show that the integer roots of of a univariate polynomial with integer coe cients can be computed in polynomial time This re sult holds for the classical i e Turing model of computation and a sparse representation of polynomials i e coe cients and exponents are written in binary and only nonzero monomials are represented
متن کاملUnivariate polynomial solutions of algebraic difference equations
Contrary to linear difference equations, there is no general theory of difference equations of the form G(P (x − τ1), . . . , P (x − τs)) + G0(x)=0, with τi ∈ K, G(x1, . . . , xs) ∈ K[x1, . . . , xs] of total degree D ≥ 2 and G0(x) ∈ K[x], where K is a field of characteristic zero. This article is concerned with the following problem: given τi, G and G0, find an upper bound on the degree d of a...
متن کاملPolynomial Chaos for Linear Differential Algebraic Equations with Random Parameters
Technical applications are often modeled by systems of differential algebraic equations. The systems may include parameters that involve some uncertainties. We arrange a stochastic model for uncertainty quantification in the case of linear systems of differential algebraic equations. The generalized polynomial chaos yields a larger linear system of differential algebraic equations, whose soluti...
متن کاملCoupled systems of equations with entire and polynomial functions
We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1} A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We derive a priory estimates for the sums of the rootsof the considered system andfor the counting function of roots.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2006
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2005.12.003